Method for Two-Stage Query Optimization in Massively Parallel Processing Database Clusters

ABSTRACT

Queries may be processed more efficiently in an massively parallel processing (MPP) database by locally optimizing the global execution plan. The global execution plan and a semantic tree may be provided to MPP data nodes by an MPP coordinator. The MPP data nodes may then use the global execution plan and the semantic tree to generate a local execution plan. Thereafter, the MPP data nodes may select either the global execution plan or the local execution plan is accordance with a cost evaluation.

TECHNICAL FIELD

The present disclosure relates to database systems and methods, and, in particular embodiments, to a method for two-stage query optimization in massively parallel processing database cluster.

BACKGROUND

Massively parallel processing (MPP) is the coordinated processing of a program by multiple processors, with each processor working on different parts of the program. The processors communicate with one another to complete a task, but otherwise rely on their own operating system and memory resources. MPP database systems are based on shared-nothing architectures, where the database is partitioned into segments and distributed to a plurality of processors (data nodes) for parallel processing. Because each data node stores only a portion of the MPP database concurrently, database operations (e.g., search, scan, etc.) are performed more quickly than would otherwise be possible in a sequential processing system.

Clients access information in MPP databases by interacting with an MPP coordinator, which is a process configured to receive and respond to queries. More specifically, for each issued query the MPP coordinator consults a global catalog to develop a single query plan (referred to herein as a ‘global execution plan’), which is then distributed to each of the MPP data nodes for local execution. Notably, the MPP's coordinator's global view of resources and data distribution may lack knowledge of local configuration information and/or statistics local to the MPP data nodes, and, instead, may make generalized assumptions about, inter alia, local data distribution and/or resource availability. For instance, the MPP coordinator may assume that data is evenly distributed amongst the various MPP data nodes and/or that the MPP data nodes' resources (e.g., processing or otherwise) are unconstrained. As a result, the MPP coordinator's global execution plan may be sub-optimal for one or more of the local MPP data nodes, which may lead to inefficient execution of the global execution plan. Accordingly, mechanisms for improving query optimization in MPP database systems are desired. SUMMARY

Technical advantages are generally achieved, by embodiments of the present disclosure which describe a method for two-stage query optimization in massively parallel processing database cluster.

In accordance with an embodiment, a method for processing queries in a massively parallel processing (MPP) database is provided. In this example, the method includes receiving, by an MPP data node, a global execution plan and a semantic tree from an MPP coordinator, generating, by the MPP data node, a local execution plan in accordance with the semantic tree; and selecting either the global execution plan or the local execution plan for execution by the MPP data node. An apparatus for performing this method is also provided.

In accordance with another embodiment, a massively parallel processing (MPP) database system is provided. In this example, the system comprises one or more MPP coordinators configured to receive a query from a client; generate a semantic tree, develop a global execution plan for executing the query in accordance with the semantic tree, and distribute the global execution plan to a plurality of MPP data nodes. The system further comprises an MPP data node configured to receive the global execution plan and the semantic tree from the one or more MPP coordinators, obtain an optimized execution plan by optimizing the global execution plan using the semantic tree in accordance with local configuration information of the first MPP data node, and execute the optimized execution plan.

BRIEF DESCRIPTION OF THE DRAWINGS

For a more complete understanding of the present disclosure, and the advantages thereof, reference is now made to the following descriptions taken in conjunction with the accompanying drawings, in which:

FIG. 1 illustrates a diagram of an embodiment MPP database system;

FIG. 2 illustrates a diagram describing how a conventional database is partitioned into an MPP database;

FIG. 3 illustrates a diagram of a conventional MPP database architecture for responding to queries;

FIG. 4 illustrates a diagram of an embodiment MPP database architecture for responding to queries;

FIG. 5 illustrates a flowchart of a method for optimizing a global execution plan;

FIG. 6 illustrates a diagram of a query flow for a global execution plan;

FIGS. 7( a)-7(b) illustrate a diagram of a query flow for a locally optimized global execution plan;

FIG. 8 illustrates a flowchart of a method for processing a query that includes an additional stage of local optimization;

FIG. 9 illustrates a block diagram of a query processing module of an MPP coordinator;

FIG. 10 illustrates a diagram of a local optimizer module of an MPP data node;

FIG. 11 illustrates a flowchart of a process for locally optimizing a global execution plan at an MPP data node; and

FIG. 12 illustrates a high-level block diagram of an MPP data node.

Corresponding numerals and symbols in the different figures generally refer to corresponding parts unless otherwise indicated. The figures are drawn to clearly illustrate the relevant aspects of the embodiments and are not necessarily drawn to scale.

DETAILED DESCRIPTION OF ILLUSTRATIVE EMBODIMENTS

The making and using of embodiments of this disclosure are discussed in detail below. It should be appreciated, however, that the concepts disclosed herein can be embodied in a wide variety of specific contexts, and that the specific embodiments discussed herein are merely illustrative and do not serve to limit the scope of the claims.

Aspects of this disclosure enable MPP data nodes to locally optimize global execution plans in accordance with their own configuration information. More specifically, an MPP data node will generate a local execution plan in accordance with a semantic tree provided by the MPP coordinator. The local execution plan may be tailored to local configuration information of the MPP data node (e.g., resource availability, amount and value/object distribution of locally stored data, etc.), which may be generally unavailable to the MPP coordinator. When generating the local execution plan, a sub-tree obtained from the semantic tree may be fortified using constraints associated with the global execution plan to ensure that each segment of the local execution plan satisfies those constraints.

FIG. 1 illustrates an MPP database system 100 for processing queries of a client 101. As shown, the MPP database system 100 comprises a coordinator 105 commutatively coupled to a plurality of data nodes 110-140. The coordinator 105 may be any device configured to execute queries on behalf of the client 101. Executing such queries may involve developing a global execution plan including one or more local plan segments that outline processing flows for the data nodes 110-140. The data nodes 110-140 may be any components having access (e.g., exclusive access) to a partition of the MPP database system 100. The data nodes 110-140 may be configured to optimize the global execution plan and/or corresponding segments of the global execution plan, and thereafter to execute corresponding plan segments to produce a query result.

FIG. 2 illustrates an example of how a database 200 is partitioned into an MPP database 250. As shown, the database 200 comprises a first table (t1) 210, a second table (t2) 220, and a third table (t3) 230. The tables 210-230 may differ in size, and may include different numbers of columns. As the tables 210-230 are filled with additional data, the database 200 may become too large for a single processor to efficiently handle. Accordingly, it may be beneficial to partition the database 200 into the MPP database 250. As shown, the MPP database 250 comprises a plurality of partitions 251-253, each of which houses a portion of data obtained from the database 200. While FIG. 2 shows each of the partitions 251-253 including a corresponding portion of each of the tables 210-230, other embodiment MPP architectures may distribute data differently. For instance, the t1 210 could be stored in a single one of the partitions 251-253, or, alternatively, could be distributed across two of partitions 251-253. In any event, it is quite likely that data will be distributed amongst the partitions 251-253 in an un-even/non-uniform fashion.

Traditional query execution flow includes the coordinator receiving a query from a client, compiling it, generating a global execution plan, and sending the global execution plan to each data node. Thereafter, each data node may instantiate one or more segments of the global execution plan, exchange data with one another (if need be), and compute results for the query and return it the coordinator. The coordinator gathers results from data nodes, does the final processing, and returns the query response to the client.

FIG. 3 illustrates a diagram of a conventional MPP architecture 300 for responding to queries from a client 301. The MPP architecture 300 includes an MPP coordinator 305 and a data node 310 (other data nodes are omitted for purposes of clarity and concision). The MPP coordinator 305 includes a parsing and semantics module 306 for processing queries, a global execution plan generator 307 for generating a global execution plan, and an executor 308 for gathering/aggregating results and assembling a query response. The parsing and semantics module 306 may receive a query from the client 301, and develop a semantic tree. The semantic tree may be a general outline for responding to the query, and may form the foundation upon which the global execution plan is built. The semantic tree may then be sent to the global execution plan generator 307, which may generate the global execution plan in accordance with a global view of data distribution and resources. More specifically, the global execution plan may be generated under the assumption that data was evenly distributed across the data nodes and/or that the data nodes have unconstrained resources. The global execution plan may then be sent to the executor 308, the data node 310, and other data nodes in the MPP architecture 300.

The data node 310 may include a plan execution module 312 for executing the global execution plan received from the MPP coordinator 305. Executing the global execution plan may include various database processes, such as searching/scanning databases, aggregating results, joining results, interacting with other data nodes of the MPP database to transfer and/or gather results, etc. After generating the result, the data node 310 may transfer the result (directly or indirectly) to the MPP coordinator 305. For instance, the result may be forwarded directly to the MPP coordinator 305, or the result may be indirectly transferred to another data node for further processing (e.g., aggregation with results from other data nodes, etc.) before ultimately being forwarded to the MPP coordinator 305. Upon receiving results from each of the data nodes in the MPP database, the executor 308 may aggregate the results to obtain a query response. The query response may then be returned to the client 301.

FIG. 4 illustrates a diagram of an embodiment MPP architecture 400 for responding to queries from a client 401. The embodiment MPP architecture 400 includes an MPP coordinator 405, a data node 410, and other data nodes (omitted for purposes of clarity and concision). The MPP coordinator 405 may be configured similarly in some respects to the MPP coordinator 305, except that the MPP coordinator 405 is configured to send the semantic tree as well as the global execution plan to the data node 410. The data node 410 is quite different from the data node 310, in that the data node 410 comprises a local optimization module 411 configured to optimize the execution plan in view of local configuration information native to the data node 410. More specifically, a local execution plan (or local execution plan segments) may be developed in accordance with the semantic tree, and thereafter more efficient of the global and local execution plan or plan-segments may be selected in accordance with a cost evaluation. For instance, if a local plan segment has a lower cost than the corresponding global plan segment, then the local plan segment may be selected for execution.

In embodiments, the local optimization module 411 may use constraints defined by the global execution plan to fortify the semantic tree (or a sub-tree derived therefrom), in order to ensure that said constraints are satisfied. The local optimization module 411 may then send the selected execution plan to the plan execution module 412, which may execute the plan. The plan execution module 412 may thereafter transfer the result (directly or indirectly) to the executor 408 for processing into the query response.

FIG. 5 illustrates a method 500 for operating a data node. The method 500 begins at step 510, where a global execution plan and semantic tree are received from the MPP coordinator. Thereafter, the method 500 proceeds to step 520, where a sub-tree is identified from the semantic tree. Next, the method 500 proceeds to step 530, where the sub-tree is fortified using constraints of the global execution plan. Subsequently, the method 500 proceeds to step 540, where a local execution plan is generated in accordance with the fortified sub-tree. Thereafter, the method 500 proceeds to step 550, where one of the global execution plan and the local execution plan is selected based on cost criteria. Next, the method 500 proceeds to step 550, where the selected execution plan is executed to obtain a result, and the result is transferred (directly or indirectly) to the MPP coordinator.

FIG. 6 illustrates a query flow 600 of a global execution plan for responding to a query. The MPP database comprises a customer table partitioned between data nodes 1 and 2, and a line item table and order table partitioned amongst data nodes 1, 2, and 3 The first segment is executed by MPP coordinator; the second segment is executed by data nodes 1 and 2, and the third segment is executed by data node 1, 2, and 3. The join result between order and line-item will be repartitioned on customerId before joining with customer table in the second segment. This is accomplished by coupling of the top TRANSFER operator in the third segment and GATHER operator in the second segment. Notably, in the query flow 600, the execution plan for the second segment is identical for nodes 1 and 2, and the execution plan for the third segment is identical for nodes 1, 2, and 3.

FIG. 7 illustrates a query flow 700 of a locally optimized global execution plan for responding to a query. As shown, the plan segments executed on each data node differ from one another as a result of local optimization. For example, while the second segment on node 1 is the same as the original plan (shown in FIG. 6), the argument order of hash join of the second segment on node 2 is different from the original plan even though the join method is the same. This can be triggered, for example, by the fact the number of qualified rows in customer table on node 3 is significantly less than original estimated, assuming other factors are the same. For the third segment, the plan on node 1 is the same as the original; the plan on node 2 uses different argument order of hash join; and the plan on node 3 uses different join methods completely.

FIG. 8 illustrates a method for processing a query that includes an additional stage of local optimization. As shown, the query plan is received at each data node, after which each data node analyzes each plan segment applicable to itself to see if it can be re-optimized. If so, a new best plan for the segment is selected, instantiated, and executed to compute the query results for the segment. Results will be sent as input to the next segment.

FIG. 9 illustrates an MPP coordinator 900. The main job of the MPP coordinator 900 is to plan the execution strategy of operations that compute the query result. This includes the table access path, index selection, the methods and order of join, grouping and sorting of the results and executing of sub-queries, etc. In a distributed MPP database, the MPP optimizer also considers the location of partitions so that certain operations may be executed in a manner that minimizes data movement between data nodes. The planning process may be achieved through dynamic programming, and may originate from leaves of semantic tree (e.g., a table access). From these leaves, each operation (and alternatives therefor) is generated and saved for each operation. Each level of operations is evaluated until the top of semantic tree is reached. The partition planning kicks in whenever a two stream of data is to be combined or joined. All alternatives are given a cost based on a defined cost model, and the plan with the minimum cost is selected.

FIG. 10 illustrates a local optimizer architecture 1000 that may be included in data nodes to achieve local optimization of the global plan. The local optimizer can be a simplified version of the original optimizer. Notably, the local optimizer architecture 1000 does not contain partition planner as the semantic operations corresponding in the input sub-tree are localized. In some embodiments, the operations corresponding in the input sub-tree are always localized. Also local optimizer architecture 1000 may consider data statistics for local partition and locally resource availability, which may be specified by configuration information native to the data node housing the local optimizer architecture 1000.

FIG. 11 illustrates a process flow 1100 for locally optimizing one or more segments of a global execution plan, as may be performed by a data node. After receiving the global execution plan, the data node will execute the flow of logic to generate an alternative local execution plan that maintains the semantic constraints of the global execution plan. The various segments may be executed in accordance with different partition schema. For each applicable segment, the corresponding data node identifies the sub-tree, and fortified (modifies) the sub-tree to reflect constraints of the global execution plan. Fortification may be an important step to maintain correctness of overall (global) plan, as the output of plan segment may correspond to the input of another plan segment. For planning purpose, those inputs from other segments will be converted into local temp table with cardinality as calculated in the original global plan, so all the joins and other operations are treated as being local to the sub-tree. The constraints may include (but are not limited to) the ordering of result set, the distinctness of result set, the number of rows must be contained in the result set, etc. Thereafter, the local optimizer (in the MPP data node) selects the best plan for the sub-tree. Local optimizer is a simplified version of original optimizer because it does not have to deal with partition planning, and remote operations. The original plan segment is replaced by the best plan selected by the local optimizer, and execution continues with new plan segment for the query.

FIG. 12 illustrates a block diagram of an embodiment of an MPP data node 1200. The MPP data node 1200 may include a processor 1204, a memory 1206, and a plurality of interfaces 1210-1214, which may (or may not) be arranged as shown in FIG. 12. The processor 1204 may be any component capable of performing computations and/or other processing related tasks, and the memory 1206 may be any component capable of storing programming and/or instructions for the processor 1204. The interfaces 1210-1214 may be any component or collection of components that allows the MPP data node 1200 to communicate with other devices, such as neighboring MPP data nodes, the MPP coordinator, etc.

Aspects of this disclosure allow segments of a global execution plan to be optimized locally at each data node in accordance with local configuration information. This allows each data node to customize the execution plan (within semantic constraints) for faster processing of database queries.

Although the description has been described in detail, it should be understood that various changes, substitutions and alterations can be made without departing from the spirit and scope of this disclosure as defined by the appended claims. Moreover, the scope of the disclosure is not intended to be limited to the particular embodiments described herein, as one of ordinary skill in the art will readily appreciate from this disclosure that processes, machines, manufacture, compositions of matter, means, methods, or steps, presently existing or later to be developed, may perform substantially the same function or achieve substantially the same result as the corresponding embodiments described herein. Accordingly, the appended claims are intended to include within their scope such processes, machines, manufacture, compositions of matter, means, methods, or steps. 

What is claimed:
 1. A method for processing queries in a massively parallel processing (MPP) database, the method comprising: receiving, by an MPP data node, a global execution plan and a semantic tree from an MPP coordinator; generating, by the MPP data node, a local execution plan in accordance with the semantic tree; and selecting either the global execution plan or the local execution plan for execution by the MPP data node.
 2. The method of claim 1, wherein the execution plan and the semantic tree correspond to a query made by a client.
 3. The method of claim 1, wherein selecting either the global execution plan or the local execution plan for execution by the MPP data node comprises: determining a cost for each of the local execution plan and the global execution plan in accordance with a defined cost model; selecting the local execution plan when the local execution plan has a lower cost than the global execution plan; and selecting the global execution plan when the local execution plan has an equal or greater cost than the global execution plan.
 4. The method of claim 3, wherein the defined cost model accounts for local configuration information native to the MPP data node, and wherein the local configuration information native to the MPP data node is unavailable to the MPP coordinator when generating the global execution plan.
 5. The method of claim 4, wherein the global execution plan is generated by the MPP coordinator under the assumption that data is uniformly distributed amongst a plurality of MPP data nodes in the MPP database.
 6. The method of claim 1, wherein generating the local execution plan comprises: generating the local execution plan in accordance with local configuration information native to the MPP data node, wherein the local configuration information is unavailable to the MPP coordinator when the MPP coordinator generates the global execution plan.
 7. The method of claim 6, wherein the local configuration information specifies resource constraints of the MPP data node.
 8. The method of claim 6, wherein the local configuration information specifies an amount of data stored by the MPP data node, wherein data is non-uniformly distributed in the MPP database such that the amount of data stored by the MPP data node differs from amounts of data stored in other MPP data nodes of the MPP database.
 9. The method of claim 1, wherein generating the local execution plan comprises: identifying a sub-tree of the semantic tree; fortifying the sub-tree in accordance with a set of constraints enforced by the global execution plan; and generating the local execution plan local plan in accordance with the fortified sub-tree.
 10. The method of claim 9, wherein the set of constraints enforced by the global execution plan comprise at least one of an ordering of a result set, a distinctness of result set, and a number of rows contained in the result set.
 11. A massively parallel processing (MPP) data node in an MPP database, the MPP data node comprising: a processor; and a computer readable storage medium storing programming for execution by the processor, the programming including instructions to: receive a global execution plan and a semantic tree from an MPP coordinator; generate a local execution plan in accordance with the semantic tree; and select either the global execution plan or the local execution plan for execution by the MPP data node.
 12. The MPP data node of claim 11, wherein the instructions to select either the global execution plan or the local execution plan for execution by the MPP data node includes instructions to: determine a cost for each of the local execution plan and the global execution plan in accordance with a defined cost model; select the local execution plan when the local execution plan has a lower cost than the global execution plan; and select the global execution plan when the local execution plan has an equal or greater cost than the global execution plan.
 13. The MPP data node of claim 12, wherein the defined cost model accounts for local configuration information native to the MPP data node, and wherein the local configuration information is unavailable to the MPP coordinator when the MPP coordinator generates the global execution plan.
 14. The MPP data node of claim 13, wherein the global execution plan is generated by the MPP coordinator under the assumption that data is uniformly distributed amongst a plurality of MPP data nodes in the MPP database.
 15. The MPP data node of claim 11, wherein generating the local execution plan comprises: generating the local execution plan in accordance with local configuration information native to the MPP data node, wherein the local configuration information is unavailable to the MPP coordinator when the MPP coordinator generates the global execution plan.
 16. The MPP data node of claim 15, wherein the local configuration information specifies resource constraints of the MPP data node.
 17. The MPP data node of claim 15, wherein the local configuration information specifies an amount of data stored by the MPP data node, wherein data is non-uniformly distributed in the MPP database such that the amount of data stored by the MPP data node differs from amounts of data stored in other MPP data nodes of the MPP database.
 18. The MPP data node of claim 11, wherein generating the local execution plan comprises: identifying a sub-tree of the semantic tree; fortifying the sub-tree in accordance with a set of constraints enforced by the global execution plan; and generating the local execution plan in accordance with the fortified sub-tree.
 19. A massively parallel processing (MPP) database system comprising: one or more MPP coordinators configured to: receive a query from a client; generate a semantic tree; develop a global execution plan for executing the query in accordance with the semantic tree; and distribute the global execution plan to a plurality of MPP data nodes; and a first one of the plurality of MPP data nodes configured to: receive the global execution plan and the semantic tree from the one or more MPP coordinators; obtain an optimized execution plan by optimizing the global execution plan using the semantic tree in accordance with local configuration information of the first MPP data node; and execute the optimized execution plan.
 20. The MPP database system of claim 19, wherein the local configuration information is unavailable to the one or more MPP coordinators during development of the global execution plan. 